/*#include<iostream>
using namespace std;
int main()
{
	int n,ans=0;
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		int x;
		scanf("%d",&x); 
		if(x!=1&&x!=-1)ans++;
	}
	cout<<ans;
	return 0;
}*/
/*#include<iostream>
#include<cmath> 
using namespace std;
typedef long long ll;
int main()
{
	int cnt;
	cin>>cnt;
	while(cnt--)
	{
		ll a,b,c;
		int k;
		cin>>a>>b>>c>>k;
		for(int i=0;i<k;i++)
		{
			ll a1=a,b1=b,c1=c;
			a=floor(double(b1+c1)/2);
			b=floor(double(a1+c1)/2);
			c=floor(double(a1+b1)/2);
		}
		cout<<a<<" "<<b<<" "<<c<<endl;
	}
	return 0;
}*/
/*
#include<iostream>
#include<cstring>
using namespace std;
const int N=1000500;
string a[2];
int ans=0x3f3f3f3f;
int x,y,endx,endy;
int count=0;
bool st[2][N]={false};
int dx[4]={-1,1,0,0};
int dy[4]={0,0,1,-1};
void dfs(int x,int y,int n,int d)
{
	if(n>count)return;
	if(a[x][y]=='#')n++;
	else d++;
	if(n==count){ 
		ans=min(ans,d);
		cout<<ans<<endl;
		return ;
	} 
	for(int i=0;i<4;i++)
	{
		int newx=x+dx[i];
		int newy=y+dy[i];
		if(!st[newx][newy]&&x>=0&&x<=1&&y>=0&&y<=a[0].size()-1){
			st[newx][newy]==true;
			cout<<newx<<" "<<newy<<endl;
			dfs(newx,newy,n,d);
			st[newx][newy]==false;
		} 
	}
		
}*//*
int main()
{
	
	cin>>a[0]>>a[1];
	for(int i=0;i<a[0].size();i++){
		for(int j=0;j<2;j++){
			if(a[j][i]=='#'){
				count++;
			}
		}
	}
	bool pd=false;
	cout<<count<<endl;
	for(int i=0;i<2;i++){
		for(int j=0;j<a[0].size();j++){
			if(a[j][i]=='#'){
				cout<<i<<" "<<j<<endl;
				st[i][j]=true;
				pd=true;
				dfs(i,j,0,0);
				break;
			}
		}
		if(pd)break;
	}
	cout<<ans;
	
}*/


#include<iostream>
#include<cmath>
using namespace std;
int main()
{
	double x;
	x=(666*666+233*233)/466;
	cout<<x*2;
	//cout<<pow(2,3);
}
/*#include<iostream>
#include<algorithm>
using namespace std;
const int N=100500;
typedef long long ll;
ll num[N];
int main()
{
	int n,m;
	cin>>n>>m;
	ll ans=1e18;
	for(int i=0;i<n;i++)cin>>num[i];
	sort(num,num+n);
	for(int i=0;i<n;i++){
		ll d=0;
		for(int j=i;j<i+m-1;j++){
			d+=abs(pow(num[i+1],2)-pow(num[i],2));
		}
		ans=min(d,ans);		
	} 
	cout<<ans;
	return 0;
}


*/
/*#include<iostream>
#include<functional>
const int N=1000; 
int num[N];
using namespace std;
function<int(int,int)> f[3]{
	 [](int a,int b) {return a^b;},
	 [](int a,int b) {return a+b;},
	 [](int a,int b) {return a-b;}
};
void dfs()
{
	x
}
int	main(){
	int n;
	cin>>n;
	for(int i=0;i<n;i++)cin>>num[i];	
}
*/
/*#include<iostream>
#include<vector>
using namespace std;
const int N=1100;
int a[N];
vector<vector<int>>s(N);
vector<vector<int>>tree(N);
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=0;i<n-1;i++) {
		int x,d;
		cin>>x>>d;
		tree[x].push_back(d);
	}
	for(int i=1;i<=n;i++) {
		for(auto ch:tree[i]){
			s[i]+=ch;
		}
	}
	for(int i=1;i<=n;i++)
	{
		if(tree[i]<s[i])
		{
			
		}	
	}
	cout<<a[1];
		
}
*/
/*#include<iostream>
const int N=1e5+500;
const int MOD=1e9+7;
int num[N];
using namespace std;
int main()
{
	int n;
	cin>>n;
	for(int i=0;i<n;i++)cin>>num[i]; 
	long long ans=0;
	for(int i=n-1;i>=1;i--){
		long long d=num[0];
		int j=1;
		for(;j<=i;j++){
			d^=num[j];
			d%=MOD;
		}
		ans+=d*(n-i)%MOD;
		ans%=MOD;
	} 
	cout<<ans;
	return 0;
 
}*/










